There are no finite partial cubes of girth more than 6 and minimum degree at least 3
نویسندگان
چکیده
منابع مشابه
There are no finite partial cubes of girth more than 6 and minimum degree at least 3
Partial cubes are graphs isometrically embeddable into hypercubes. We analyze how isometric cycles in partial cubes behave and derive that every partial cube of girth more than six must have vertices of degree less than three. As a direct corollary we get that every regular partial cube of girth more than six is an even cycle. Along the way we prove that every partial cube G with girth more tha...
متن کاملThere are no finite partial cubes of girth more than six and minimum degree at least three
Partial cubes are graphs isometrically embeddable into hypercubes. We analyze how isometric cycles in partial cubes behave and derive that every partial cube of girth more than six must have vertices of degree less than three. As a direct corollary we get that every regular partial cube of girth more than six is an even cycle. Along the way we prove that every partial cube G with girth more tha...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملDomination in Graphs of Minimum Degree at least Two and Large Girth
We prove that for graphs of order n, minimum degree δ ≥ 2 and girth g ≥ 5 the domination number γ satisfies γ ≤ ( 1 3 + 2 3g ) n. As a corollary this implies that for cubic graphs of order n and girth g ≥ 5 the domination number γ satisfies γ ≤ ( 44 135 + 82 135g ) n which improves recent results due to Kostochka and Stodolsky (An upper bound on the domination number of n-vertex connected cubic...
متن کاملThere are no Barker arrays having more than two dimensions
Davis, Jedwab and Smith recently proved that there are no 2-dimensional Barker arrays except of size 2×2. We show that the existence of a (d+1)-dimensional Barker array implies the existence of a d-dimensional Barker array with the same number of ±1 elements. We deduce that there are no Barker arrays having more than two dimensions, as conjectured by Dymond in 1992.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2016.01.005